Small covering designs by branch-and-cutMARGOT, Francois.Mathematical programming. 2003, Vol 94, Num 2-3, pp 207-220, issn 0025-5610, 14 p.Conference Paper

On the domino-parity inequalities for the STSPBOYD, Sylvia; COCKBURN, Sally; VELLA, Danielle et al.Mathematical programming. 2007, Vol 110, Num 3, pp 501-519, issn 0025-5610, 19 p.Article

A note on the undirected rural postman problem polytopeREINELT, Gerhard; THEIS, Dirk Oliver.Mathematical programming. 2006, Vol 106, Num 3, pp 447-452, issn 0025-5610, 6 p.Article

Polyhedral results for two-connected networks with bounded ringsFORTZ, B; LABBE, M.Mathematical programming. 2002, Vol 93, Num 1, pp 27-54, issn 0025-5610Article

Detecting symmetries by Branch & CutBUCHHEIM, Christoph; JÜNGER, Michael.Lecture notes in computer science. 2002, pp 178-188, issn 0302-9743, isbn 3-540-43309-0Conference Paper

A branch-and-cut algorithm for the Undirected Rural Postman ProblemGHIANI, G; LAPORTE, G.Mathematical programming. 2000, Vol 87, Num 3, pp 467-481, issn 0025-5610Article

GD 2002 : graph drawing (Irvine CA, 26-28 August 2002, revised papers)Goodrich, Michael T; Kobourov, Stephen G.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-00158-1, XIII, 384 p, isbn 3-540-00158-1Conference Proceedings

Eulerian location problemsGHIANI, G; LAPORTE, G.Networks (New York, NY). 1999, Vol 34, Num 4, pp 291-302, issn 0028-3045Article

A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphsSUHL, U. H; HILBERT, H.Networks (New York, NY). 1998, Vol 31, Num 4, pp 273-282, issn 0028-3045Article

Introduction to ABACUS : a branch-and-cut systemJÜNGER, M; THIENEL, S.Operations research letters. 1998, Vol 22, Num 2-3, pp 83-95, issn 0167-6377Article

Computational trends and effects of approximations in an MILP model for process planningMING LONG LIU; SAHINIDIS, N. V.Industrial & engineering chemistry research. 1995, Vol 34, Num 5, pp 1662-1673, issn 0888-5885Article

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and deliverySUBRAMANIAN, Anand; UCHOA, Eduardo; ALVES PESSOA, Artur et al.Operations research letters. 2011, Vol 39, Num 5, pp 338-341, issn 0167-6377, 4 p.Article

New formulations and valid inequalities for a bilevel pricing problemDEWEZ, Sophie; LABBD, Martine; MARCOTTE, Patrice et al.Operations research letters. 2008, Vol 36, Num 2, pp 141-149, issn 0167-6377, 9 p.Article

A branch-and-cut algorithm for the pallet loading problemALVAREZ-VALDES, R; PARRENO, F; TAMARIT, J. M et al.Computers & operations research. 2005, Vol 32, Num 11, pp 3007-3029, issn 0305-0548, 23 p.Article

Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loadingCORDEAU, Jean-François; DELL'AMICO, Mauro; IORI, Manuel et al.Computers & operations research. 2010, Vol 37, Num 5, pp 970-980, issn 0305-0548, 11 p.Article

A note on the continuous mixing setZHAO, M; DE FARIAS, I. R.Operations research letters. 2008, Vol 36, Num 6, pp 726-733, issn 0167-6377, 8 p.Article

Solving capacitated arc routing problems using a transformation to the CVRPLONGO, Humberto; POGGI DE ARAGAO, Marcus; UCHOA, Eduardo et al.Computers & operations research. 2006, Vol 33, Num 6, pp 1823-1837, issn 0305-0548, 15 p.Article

A branch and cut algorithm for hub location problems with single assignmentLABBE, Martine; YAMAN, Hande; GOURDIN, Eric et al.Mathematical programming. 2005, Vol 102, Num 2, pp 371-405, issn 0025-5610, 35 p.Article

Using simulated annealing to design a material-handling system : Advanced heuristics in transportation and logisticsCARICATO, Pierpaolo; GRIECO, Antonio.IEEE intelligent systems. 2005, Vol 20, Num 4, pp 26-30, issn 1541-1672, 5 p.Article

On capacitated network design cut-set polyhedraATAMTÜRK, Alper.Mathematical programming. 2002, Vol 92, Num 3, pp 425-437, issn 0025-5610Conference Paper

A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windowsAYKIN, T.The Journal of the Operational Research Society. 1998, Vol 49, Num 6, pp 603-615, issn 0160-5682Article

On splittable and unsplittable flow capacitated network design arc-set polyhedraATAMTÜRK, Alper; RAJAN, Deepak.Mathematical programming. 2002, Vol 92, Num 2, pp 315-333, issn 0025-5610Article

Combinatorial algorithms for the maximum k-plex problemMCCLOSKY, Benjamin; HICKS, Illya V.Journal of combinatorial optimization. 2012, Vol 23, Num 1, pp 29-49, issn 1382-6905, 21 p.Article

A branch and cut algorithm for the hierarchical network design problemOBREQUE, Carlos; DONOSO, Macarena; GUTIERREZ, Gabriel et al.European journal of operational research. 2010, Vol 200, Num 1, pp 28-35, issn 0377-2217, 8 p.Article

An exact approach for the vehicle routing problem with two-dimensional loading constraintsIORI, Manuel; SALAZAR-GONZALEZ, Juan-José; VIGO, Daniele et al.Transportation science. 2007, Vol 41, Num 2, pp 253-264, issn 0041-1655, 12 p.Article